Hub location problem with balanced round-trip flows on hub links

This paper addresses the classical single and multiple allocation hub location problems with fully interconnected hubs, in which balanced round-trip flows on links are considered strategic decision making process. The use of is motivated by need to decrease empty-trip rate vehicles increase full-load vehicles. Mixed-integer programming models presented for versions problems. Numerical experiments CAB AP datasets performed analyse impacts network configurations utilisation service resources. Experimental results show that number located hubs tends a allowable unbalanced degree link flows. transportation resources can be significantly improved small traditional operating cost. Moreover, better modelling economies scale achieved when considering [Received: 22 September 2019; Accepted: 15 March 2020]